Reactive standard deontic logic
نویسندگان
چکیده
We introduce a reactive variant of SDL (standard deontic logic): SDLR1 (reactive standard deontic logic). Given a Kripkean view on the semantics of SDL in terms of directed graphs where arrows → represent the accessibility relation between worlds, reactive models add two elements: arrows → are labelled as “active” or “inactive”, and double arrows ։ connect arrows, e.g., (x1 → x2) ։ (x3 → x4). The idea is that passing through x1 → x2 activates a switch represented by ։ which inverts the label of x3 → x4 and hence activates resp. deactivates this arrow. This allows to introduce two modalities: is the usual KD-modality of SDL and operates on the Kripkean graph where all labels and double arrows are ignored, while ⊘ takes them into account. We demonstrate that RSDL1 allows for an intuitive interpretation of ‘ought’. The logic can handle contrary-to-duty cases such as several instantiations of the Chisholm set in a paradox-free way by means of using double arrows and annotations to block and give access to ideal worlds. 1 Standard Deontic Logic and its Problems A logic with modality is KD modality if we have the axioms K0 All substitution instances of classical tautologies K1 (p ∧ q) ≡ ( p ∧ q) K2 ⊢ A ⇒ ⊢ A D ¬ ⊥ It is complete for frames of the form (S ,R, a) where S , ⊘ is a set of possible worlds, a ∈ S ,R ⊆ S × S is serial (i.e., for all x there exists a y such that xRy). Standard Deontic Logic SDL is a KD modality O. We read u Op as saying p holds in all ideal worlds relative to u, i.e. for all t we have: if uRt then t p. So the set of ideal worlds relative to u is the set I(u) = {t | uRt}.
منابع مشابه
Modeling Chisholm’s Logic of Obligation, Requirement, and Defeat
It is well known that Standard Deontic Logic (SDL) suffers from a number of troubling paradoxes. Despite many years of efforts to resolve the paradoxes, there is no consensus that such efforts have been successful, and indeed [Hansen, 2006] argues that the paradoxes are “alive and kicking.” These continued difficulties with SDL motivate careful study of nonstandard deontic logics, such as Chish...
متن کاملMally's Deontic Logic: Reducibility and Semantics
We discuss three aspects of the intuitionistic reformulation of Mally’s deontic logic that was recently proposed (Journal of Philosophical Logic (2013) 42:635–641). First, this reformulation is more similar to Standard Deontic Logic than appears at first sight: like Standard Deontic Logic, it is Kanger reducible and Anderson reducible to alethic logic and it has a semantical interpretation that...
متن کاملIntroducing Exclusion Logic as a Deontic Logic
This paper introduces Exclusion Logic a simple modal logic without negation or disjunction. We show that this logic has an efficient decision procedure. We describe how Exclusion Logic can be used as a deontic logic. We compare this deontic logic with Standard Deontic Logic and with more syntactically restricted logics.
متن کاملSpecifying and reasoning about normative systems in deontic logic programming
In this paper we propose the usage of a framework combining standard deontic logic (SDL) and non-monotonic logic programming – deontic logic programs (DLP) – to represent and reason about normative systems.
متن کاملA logic for deontic dilemmas
The possibility of deontic dilemmas poses a significant problem for deontic logic. Here I review some proposals to resolve this problem, and then offer a new account. This is a simple modification of standard deontic logic that enables the system to accommodate deontic dilemmas without inconsistency and without deontic explosion, while at the same time accounting for the range of genuinely vali...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Log. Comput.
دوره 25 شماره
صفحات -
تاریخ انتشار 2015